A discussion of postorder - traverse binary tree with no - recursive algorithm 遞歸算法的非遞歸化研究
The recursive and non - recursive algorithm of post - traversing binary tree 二叉樹后序遍歷的遞歸和非遞歸算法
Traversing binary tree 遍歷二叉樹
According to binary tree level traversal principle , this article embarks from fully binary tree ' s definition and the nature , and proposes a method to judge fully binary tree on the basis of traversing binary tree 摘要從完全二叉樹的定義及性質(zhì)出發(fā),根據(jù)二叉樹的層次遍歷原則,提出了一種遍歷法判斷完全二叉樹的方法。
It presents the arithmetic that is achieved by postorder traversing binary tree , which is built from aov diagraph , based on investigating the arithmetic of interchanging between the ladder diagram and instruction list , and the interpretation and execution of plc programming language . the whole software is developed in visual c + + ide with mfc and multi - threads mechanism . the software is well constructed and conforms to a standard of iec61131 在重點研究了編程軟件中梯形圖與指令表程序的轉(zhuǎn)換算法以及指令解釋執(zhí)行的原理和方法的基礎(chǔ)上,提出了由aov有向圖建立二叉樹、并對其進行后序遍歷來實現(xiàn)梯形圖程序與指令表程序轉(zhuǎn)換的算法,并給出了算法在編程軟件中的具體實現(xiàn)。